Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
811	IEEE TRANSACTIONS ON INFORMATION THEORY 1 Add to Reading List Source URL: www.cs.virginia.edu Language: English - Date: 2007-07-25 17:56:47 Applied mathematics Context-free grammar Formal grammar LL parser Terminal and nonterminal symbols String Time complexity Lempel–Ziv–Welch LZ77 and LZ78 Formal languages Theoretical computer science Mathematics
812	CATS 2002 Preliminary Version Efficient Algorithms for the Maximum Add to Reading List Source URL: www.cosc.canterbury.ac.nz Language: English - Date: 2003-02-10 18:47:35 Numerical linear algebra Dynamic programming Analysis of algorithms Computational complexity theory Matrix theory Maximum subarray problem Matrix Time complexity Shortest path problem Mathematics Theoretical computer science Algebra
813	Ricardo Baeza-Yates and Gaston H. Gonnet A New Add to Reading List Source URL: www.researchgate.net Language: English Mathematics String matching algorithms Pattern matching Donald Knuth Knuth–Morris–Pratt algorithm String searching algorithm Bitap algorithm Randomized algorithm Time complexity Theoretical computer science Applied mathematics Analysis of algorithms
814	i Computational Complexity: A Modern Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2007-01-08 22:00:26 Complexity classes NP P versus NP problem Cook–Levin theorem P Boolean satisfiability problem Reduction Time complexity Co-NP-complete Theoretical computer science Computational complexity theory Applied mathematics
815	Stefan Schimanski Polynomial Time Calculi Add to Reading List Source URL: edoc.ub.uni-muenchen.de Language: English - Date: 2012-10-16 04:26:53 Complexity classes Logic Type theory Metalogic Program analysis Type system Computational complexity theory Algorithm Polynomial Theoretical computer science Mathematics Mathematical logic
816	REPORTS IN INFORMATICS Add to Reading List Source URL: www.ii.uib.no Language: English - Date: 2007-08-06 05:58:33 NP-complete problems Dominating set Graph coloring Travelling salesman problem Approximation algorithm Algorithm Feedback vertex set Time complexity Set cover problem Theoretical computer science Computational complexity theory Mathematics
817	PRIMALITY PROVING VIA ONE ROUND IN ECPP AND ONE ITERATION IN AKS∗ QI CHENG† Add to Reading List Source URL: www.cs.ou.edu Language: English - Date: 2003-11-12 15:51:20 Abstract algebra AKS primality test Primality certificate Prime number Elliptic curve primality proving Randomized algorithm Probable prime Elliptic curve Time complexity Primality tests Mathematics Theoretical computer science
818	Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time DANIEL A. SPIELMAN Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2007-02-04 13:37:47 Operations research Convex optimization Linear programming Computational complexity theory Mathematical optimization Smoothed analysis Simplex algorithm Simplex Normal distribution Mathematics Geometry Applied mathematics
819	1983 Society for Industrial and Applied Mathematics[removed][removed] $[removed] Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2004-04-07 20:52:44 Operations research Linear programming Computational geometry Combinatorial optimization Convex optimization Time complexity P Mathematical optimization Quadratic programming Theoretical computer science Mathematics Applied mathematics
820	Midterm • 30 points • Mean: 22.4 Median: 24 Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2013-02-20 17:40:47 Complexity classes Structural complexity theory Time hierarchy theorem PP P Time complexity MAX-3SAT Theoretical computer science Computational complexity theory Applied mathematics

UPDATE